Manually analyzing spermatozoa is a tremendous task for biologists due to the many fast-moving spermatozoa, causing inconsistencies in the quality of the assessments. Therefore, computer-assisted sperm analysis (CASA) has become a popular solution. Despite this, more data is needed to train supervised machine learning approaches in order to improve accuracy and reliability. In this regard, we provide a dataset called VISEM-Tracking with 20 video recordings of 30s of spermatozoa with manually annotated bounding-box coordinates and a set of sperm characteristics analyzed by experts in the domain. VISEM-Tracking is an extension of the previously published VISEM dataset. In addition to the annotated data, we provide unlabeled video clips for easy-to-use access and analysis of the data. As part of this paper, we present baseline sperm detection performances using the YOLOv5 deep learning model trained on the VISEM-Tracking dataset. As a result, the dataset can be used to train complex deep-learning models to analyze spermatozoa. The dataset is publicly available at https://zenodo.org/record/7293726.

Head and neck cancers are the fifth most common cancer worldwide, and recently, analysis of Positron Emission Tomography (PET) and Computed Tomography (CT) images has been proposed to identify patients with a prognosis. Even though the results look promising, more research is needed to further validate and improve the results. This paper presents the work done by team MLC for the 2022 version of the HECKTOR grand challenge held at MICCAI 2022. For Task 1, the automatic segmentation task, our approach was, in contrast to earlier solutions using 3D segmentation, to keep it as simple as possible using a 2D model, analyzing every slice as a standalone image. In addition, we were interested in understanding how different modalities influence the results. We proposed two approaches; one using only the CT scans to make predictions and another using a combination of the CT and PET scans. For Task 2, the prediction of recurrence-free survival, we first proposed two approaches, one where we only use patient data and one where we combined the patient data with segmentations from the image model. For the prediction of the first two approaches, we used Random Forest. In our third approach, we combined patient data and image data using XGBoost. Low kidney function might worsen cancer prognosis. In this approach, we therefore estimated the kidney function of the patients and included it as a feature. Overall, we conclude that our simple methods were not able to compete with the highest-ranking submissions, but we still obtained reasonably good scores. We also got interesting insights into how the combination of different modalities can influence the segmentation and predictions.

In recent years, reinforcement learning (RL) has become increasingly successful in its application to science and the process of scientific discovery in general. However, while RL algorithms learn to solve increasingly complex problems, interpreting the solutions they provide becomes ever more challenging. In this work, we gain insights into an RL agent's learned behavior through a post-hoc analysis based on sequence mining and clustering. Specifically, frequent and compact subroutines, used by the agent to solve a given task, are distilled as gadgets and then grouped by various metrics. This process of gadget discovery develops in three stages: First, we use an RL agent to generate data, then, we employ a mining algorithm to extract gadgets and finally, the obtained gadgets are grouped by a density-based clustering algorithm. We demonstrate our method by applying it to two quantum-inspired RL environments. First, we consider simulated quantum optics experiments for the design of high-dimensional multipartite entangled states where the algorithm finds gadgets that correspond to modern interferometer setups. Second, we consider a circuit-based quantum computing environment where the algorithm discovers various gadgets for quantum information processing, such as quantum teleportation. This approach for analyzing the policy of a learned agent is agent and environment agnostic and can yield interesting insights into any agent's policy.

Large language models (LLMs) have been shown to be able to perform new tasks based on a few demonstrations or natural language instructions. While these capabilities have led to widespread adoption, most LLMs are developed by resource-rich organizations and are frequently kept from the public. As a step towards democratizing this powerful technology, we present BLOOM, a 176B-parameter open-access language model designed and built thanks to a collaboration of hundreds of researchers. BLOOM is a decoder-only Transformer language model that was trained on the ROOTS corpus, a dataset comprising hundreds of sources in 46 natural and 13 programming languages (59 in total). We find that BLOOM achieves competitive performance on a wide variety of benchmarks, with stronger results after undergoing multitask prompted finetuning. To facilitate future research and applications using LLMs, we publicly release our models and code under the Responsible AI License.

我们考虑根据视觉检测自动移动机器人异常的任务。我们对相关类型的视觉异常进行分类，并讨论如何通过无监督的深度学习方法检测到它们。我们提出了一个专门为此任务构建的新型数据集，并在该任务上测试了最先进的方法。我们终于在实际情况下讨论部署。

序数模式的统计分析的最终目的是表征它们诱导的特征的分布。特别是，了解大类时间序列模型的对熵统计复杂性的联合分布将允许迄今无法获得的统计测试。在这个方向上工作，我们表征了Shannon经验的渐进分布，用于任何模型，在此模型中，真正的归一化熵既不为零也不为零。我们从中心极限定理（假设大时间序列），多元增量方法和其平均值的三阶校正获得了渐近分布。我们讨论了其他结果（精确，一阶和二阶校正）有关其准确性和数值稳定性的适用性。在建立有关香农熵的测试统计数据的一般框架内，我们提出了双边测试，该测试验证是否有足够的证据拒绝以下假设，即两个信号产生了具有相同Shannon熵的顺序模式。我们将此双边测试应用于来自三个城市（都柏林，爱丁堡和迈阿密）的每日最高温度时间序列，并获得了明智的结果。

自我监督的视觉表示学习最近引起了重大的研究兴趣。虽然一种评估自我监督表示的常见方法是通过转移到各种下游任务，但我们研究了衡量其可解释性的问题，即了解原始表示中编码的语义。我们将后者提出为估计表示和手动标记概念空间之间的相互信息。为了量化这一点，我们介绍了一个解码瓶颈：必须通过简单的预测变量捕获信息，将概念映射到表示空间中的簇。我们称之为反向线性探测的方法为表示表示的语义敏感。该措施还能够检测出表示何时包含概念的组合（例如“红色苹果”），而不仅仅是单个属性（独立的“红色”和“苹果”）。最后，我们建议使用监督分类器自动标记大型数据集，以丰富用于探测的概念的空间。我们使用我们的方法来评估大量的自我监督表示形式，通过解释性对它们进行排名，并通过线性探针与标准评估相比出现的差异，并讨论了一些定性的见解。代码为：{\ Scriptsize {\ url {https://github.com/iro-cp/ssl-qrp}}}}}。

本文提出了一种从示威（LFD）中进行深度机器人学习的新型概率方法。深度运动原语（DMP）是确定性的LFD模型，可直接将视觉信息映射到机器人轨迹中。本文扩展了DMP，并提出了一个深层概率模型，该模型将视觉信息映射到有效的机器人轨迹的分布中。提出了导致轨迹精度最高水平的结构，并与现有方法进行了比较。此外，本文介绍了一种用于学习域特异性潜在特征的新型培训方法。我们展示了在实验室的草莓收集任务中提出的概率方法和新颖的潜在空间学习的优势。实验结果表明，潜在空间学习可以显着改善模型预测性能。提出的方法允许从分布中采样轨迹并优化机器人轨迹以满足次级目标，例如避免碰撞。

本文介绍了一场组织的结果，以评估3D手姿势序列中异质手势的在线识别方法的方法。任务是检测属于以不同姿势和运动特征为特征的16个类词典的手势。该数据集具有手跟踪数据的连续序列，其中手势与不显着的动作交织在一起。在现实的混合现实交互用例中，使用HoloLens 2手指跟踪系统捕获了数据。评估不仅基于检测性能，还基于延迟和误报，使您可以根据提出的算法了解实际交互工具的可行性。比赛评估的结果表明需要进一步研究以减少识别错误，而所提出的算法的计算成本足够低。

队列研究越来越多地使用加速度计进行体育活动和久坐行为估计。这些设备往往比自我报告易于错误，可以全天捕获活动，并且是经济的。但是，在自由生活的情况下和受试者对象变化下，基于髋关节wor的数据估算久坐行为的先前方法通常是无效的或次优的。在本文中，我们提出了一个本地马尔可夫切换模型，该模型考虑了这种情况，并引入了一种姿势分类和久坐行为分析的一般程序，该程序自然适合该模型。我们的方法在时间序列中具有更改点检测方法，也是一个两个阶段分类步骤，将数据标记为3类（坐着，站立，步进）。通过严格的训练测试范例，我们表明我们的方法达到了80％的精度。此外，我们的方法是强大的，易于解释。